Integer programming methods for large-scale practical classroom assignment problems

نویسندگان

  • Antony E. Phillips
  • Hamish Waterer
  • Matthias Ehrgott
  • David M. Ryan
چکیده

7 In this paper we present an integer programming method for solving the Classroom Assignment Problem in University Course Timetabling. We introduce a novel formulation of the problem which generalises existing models and maintains tractability even for large instances. The model is validated through computational results based on our experiences at the University of Auckland, and on instances from the 2007 International Timetabling Competition. We also expand upon existing results into the computational difficulty of room assignment problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bus Assignment to Iranian Pilgrims During Pilgrimage

Among the multitude of activities of Hajj Organization which require careful planning bus assignment to the Iranian pilgrim caravans d g pilgrimage is the most important one. The objective of this assignment is to have a minimum number o standing passengers/empty seats, while satisfying a large number of operational and religious constrain. This problem was formulated as a large scale zero-one ...

متن کامل

A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers

The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...

متن کامل

An Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs

First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...

متن کامل

A New Approach for Solving Grey Assignment Problems

Linear assignment problem is one of the most important practical models in the literature of linear programming problems‎. ‎Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach‎. ‎In this way‎, ‎some researchers have used a whitening technique to solve the grey assignment p...

متن کامل

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2015